Enumerating Isolated Cliques in Synthetic and Financial Networks
نویسندگان
چکیده
We do computational studies concerning the enumeration of maximal isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We perform experiments with synthetic graphs (in the Gn,m,p model) and financial networks, proposing the enumeration of isolated cliques as a useful instrument in analyzing financial networks.
منابع مشابه
Isolation concepts for clique enumeration: Comparison and computational experiments
We do computational studies concerning the enumeration of isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We compare three isolation concepts and the...
متن کاملFinding All Maximal Connected s-Cliques in Social Networks
Cliques are commonly used for social network analysis tasks, as they are a good representation of close-knit groups of people. For this reason (as well as for others), the problem of enumerating, i.e., finding, all maximal cliques in a graph has received extensive treatment. However, considering only complete subgraphs is too restrictive in many real-life scenarios where “almost cliques” may be...
متن کاملLarge Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be viewed as a clique in the graph representing the social network. In several real life situations, finding small cliques may not be interesting as they are large in number and low in information content. Hence, in this pape...
متن کاملEnumerating Maximal Clique Sets with K-plex Constraint by using Meta-cliques
Many variants of pseudo-cliques have been introduced as relaxation models of cliques to detect communities in real world networks. For most types of pseudo-cliques, enumeration algorithms can be designed just similar to maximal clique enumerator. However, the problem of enumerating pseudo-cliques are computationally hard, because the number of maximal pseudo-cliques is huge in general. Furtherm...
متن کاملIsolation concepts for efficiently enumerating dense subgraphs
In an undirected graph G = (V,E), a set of k vertices is called c-isolated if it has less than c · k outgoing edges. Ito and Iwama [ACM Trans. Algorithms, to appear] gave an algorithm to enumerate all c-isolated maximal cliques in O(4c · c4 · |E|) time. We extend this to enumerating all maximal c-isolated cliques (which are a superset) and improve the running time bound to O(2.89c ·c2 · |E|), u...
متن کامل